Three-dimensional Grid Drawings of Graphs
نویسندگان
چکیده
A three-dimensional grid drawing of a graph G is a placement of the vertices at distinct integer points so that the straight-line segments representing the edges of G are pairwise non-crossing. It is shown that for any xed r 2, every r-colorable graph of n vertices has a three-dimensional grid drawing that ts into a box of volume O(n2). The order of magnitude of this bound cannot be improved.
منابع مشابه
Optimal three-dimensional orthogonal graph drawing in the general position model
Let G be a graph with maximum degree at most six. A three-dimensional orthogonal drawing of G positions the vertices at grid-points in the three-dimensional orthogonal grid, and routes edges along grid lines such that edge routes only intersect at common end-vertices. In this paper, we consider three-dimensional orthogonal drawings in the general position model; here no two vertices are in a co...
متن کاملTwo-Bend Three-Dimensional Orthogonal Grid Drawing of Maximum Degree Five Graphs
Some recent algorithms for 3-dimensional orthogonal graph drawing use no more than 3 bends per edge route. It is unknown if there exists a graph requiring a 3-bend edge route. In this paper we present an algorithm for 2-bend 3-dimensional orthogonal grid drawing of maximum degree 5 graphs. In addition 2-bend 3-dimensional grid drawings of the 6-regular multi-partite graphs are given.
متن کاملPath-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs
Straight-Line Grid Drawings of Graphs ? Vida Dujmović1, Pat Morin2, and David R. Wood2 1 School of Computer Science, McGill University, Montréal, Canada. E-mail: vida s.m gill. a 2 School of Computer Science, Carleton University, Ottawa, Canada. E-mail: fmorin,davidwg s s. arleton. a Abstract. We prove that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line grid ...
متن کاملTwo Algorithms for Three Dimensional Orthogonal Graph Drawing
We use basic results from graph theory to design two algorithms for constructing 3-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. Our first algorithm gives drawings bounded by an O(x/~ ) • O(x/~ • O(v~ ) box; each edge route contains at most 7 bends. The best previous result generated edge routes containing up to 16 bends per route. Our second al...
متن کاملThree-Dimensional Grid Drawings with Sub-quadratic Volume
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line-segments representing the edges are pairwise non-crossing. A O(n3/2) volume bound is proved for three-dimensional grid drawings of graphs with bounded degree, graphs with bounded genus, and graphs with no bounded complete graph as a minor. The previ...
متن کاملUpward Three-Dimensional Grid Drawings of Graphs
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges do not cross. Our aim is to produce three-dimensional grid drawings with small bounding box volume. Our first main result is that every nvertex graph with bounded degeneracy has a three-dimensional grid drawing with O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997